package com.cat.bitOperation;

/**
 * @author 曲大人的喵
 * @description https://leetcode.cn/problems/find-xor-beauty-of-array/description/
 * @create 2025/8/21 08:58
 * @since JDK17
 */

public class Solution09 {
    public int xorBeauty(int[] nums) {
        int xor = 0;
        for (int num : nums) {
            xor ^= num;
        }
        return xor;
    }
}
